Selection of a convolution function for Fourier inversion using gridding [computerised tomography application].

نویسندگان

  • J I Jackson
  • C H Meyer
  • D G Nishimura
  • A Macovski
چکیده

In the technique known as gridding, the data samples are weighted for sampling density and convolved with a finite kernel, then resampled on a grid preparatory to a fast Fourier transform. The authors compare the artifact introduced into the image for various convolving functions of different sizes, including the Kaiser-Bessel window and the zero-order prolate spheroidal wave function (PSWF). They also show a convolving function that improves upon the PSWF in some circumstances.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Selection of a Convolution Function for Fourier Inversion Using Gridding

In fields ranging from radio astronomy to magnetic resonance imaging, Fourier inversion of data not falling on a Cartesian grid has been a prbblem. As a result, multiple algorithms have been created for reconstructing images from nonuniform frequency samples. In the technique known as gridding, the data samples are weighted for sampling density and convolved with a finite kernel, then resampled...

متن کامل

An improved gridding method for spiral MRI using nonuniform fast Fourier transform.

The algorithm of Liu and Nguyen [IEEE Microw. Guided Wave Lett. 8 (1) (1998) 18; SIAM J. Sci. Comput. 21 (1) (1999) 283] for nonuniform fast Fourier transform (NUFFT) has been extended to two dimensions to reconstruct images using spiral MRI. The new gridding method, called LS_NUFFT, minimizes the reconstruction approximation error in the Least Square sense by generated convolution kernels that...

متن کامل

Gridding-based direct Fourier inversion of the three-dimensional ray transform.

We describe a fast and accurate direct Fourier method for reconstructing a function f of three variables from a number of its parallel beam projections. The main application of our method is in single particle analysis, where the goal is to reconstruct the mass density of a biological macromolecule. Typically, the number of projections is extremely large, and each projection is extremely noisy....

متن کامل

Evaluation of the EPL and GFFT algorithms for direct reconstruction of non-Cartesian k-space data

The most common strategies for reconstructing MR images acquired on an arbitrary k-space trajectory are the gridding algorithm and the direct Fourier transform (DrFT) method. In gridding, the use of the FFT yields in computational efficiency, but the reconstruction accuracy varies according to the density weighting and the convolution kernel being used. The DrFT method does not require a convol...

متن کامل

A New Exact Inversion Method for Exponential Radon Transform Using the Harmonic Analysis of the Euclidean Motion Group

This paper presents a new method for the exponential Radon transform inversion based on the harmonic analysis of the Euclidean motion group of the plane. The proposed inversion method is based on the observation that the exponential Radon transform can be modified to obtain a new transform, defined as the modified exponential Radon transform, that can be expressed as a convolution on the Euclid...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE transactions on medical imaging

دوره 10 3  شماره 

صفحات  -

تاریخ انتشار 1991